Improving Collaborative Pathfinding Using Map Abstraction
نویسندگان
چکیده
In this paper we combine recent pathfinding research on spatial abstractions, partial refinement, and space-time reservations to construct new collaborative pathfinding algorithms. We first present an enhanced version of WHCA* and then show how the ideas from WHCA* can be combined with PRA* to form CPRA*. These algorithms are shown to effectively plan trajectories for many objects simultaneously while avoiding collisions, as the original WHCA* does. These new algorithms are not only faster than WHCA* but also use less memory.
منابع مشابه
Pathfinding by Demand Sensitive Map Abstraction
In this thesis, we present a new algorithm: Demand Sensitive Map Abstraction (DSMA). DSMA is a special kind of hierarchical pathfinding algorithm in which we vary the granularity of abstraction of the high-level map based on pathfinding request demand associated with various regions in the high level map and the search time of the last path request. Additionally, the low level A* search is not ...
متن کاملBreaking Path Symmetries on 4-Connected Grid Maps
Pathfinding systems that operate on regular grids are common in the AI literature and often used in real-time video games. Typical speed-up enhancements include reducing the size of the search space using abstraction, and building more informed heuristics. Though effective each of these strategies has shortcomings. For example, pathfinding with abstraction usually involves trading away optimali...
متن کاملMemory-Efficient Abstractions for Pathfinding
From an academic perspective there has been a lot of work on using state abstraction to speed path planning. But, this work often does not directly address the needs of the game development community, specifically for mechanisms that will fit the limited memory budget of most commercial games. In this paper we bring together several related pieces of work on using abstraction for pathfinding, s...
متن کاملAn Analysis of Map-Based Abstraction and Refinement
A variety of techniques have been introduced over the last decade for abstracting search graphs and then using these abstractions for search. While some basic work has been done to predict the value of an abstraction mechanism, the results have not been validated in practice. In this paper we analyze a variety of old and new abstraction mechanisms in a pathfinding testbed and show that the work...
متن کاملBelief-Driven Pathfinding through Personalized Map Abstraction
We investigate the case of belief-driven pathfinding (BDP) according to which characters hold a personalized account of a dynamic changing game-world. BDP is concerned with maintaining and revising a set of beliefs that persists over time as a character navigates to subsequent target destinations. This allows for a differentiation among characters with different observations in the game and can...
متن کامل